Graphs determined by signless Laplacian spectra

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graphs determined by their (signless) Laplacian spectra

Let S(n, c) = K1∨(cK2∪(n−2c−1)K1), where n ≥ 2c+1 and c ≥ 0. In this paper, S(n, c) and its complement are shown to be determined by their Laplacian spectra, respectively. Moreover, we also prove that S(n, c) and its complement are determined by their signless Laplacian spectra, respectively.

متن کامل

Some Graphs Determined by Their (signless) Laplacian Spectra

Let Wn = K1 ∨ Cn−1 be the wheel graph on n vertices, and let S(n, c, k) be the graph on n vertices obtained by attaching n− 2c− 2k − 1 pendant edges together with k hanging paths of length two at vertex v0, where v0 is the unique common vertex of c triangles. In this paper we show that S(n, c, k) (c > 1, k > 1) and Wn are determined by their signless Laplacian spectra, respectively. Moreover, w...

متن کامل

Ela Graphs Determined by Their (signless) Laplacian Spectra

Let S(n, c) = K1∨(cK2∪(n−2c−1)K1), where n ≥ 2c+1 and c ≥ 0. In this paper, S(n, c) and its complement are shown to be determined by their Laplacian spectra, respectively. Moreover, we also prove that S(n, c) and its complement are determined by their signless Laplacian spectra, respectively.

متن کامل

Seidel Signless Laplacian Energy of Graphs

Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+...

متن کامل

THE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA

The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let C and K w denote the Clebsch graph and a complete graph on w vertices, respectively. In this paper, we show that the multicone graphs K w ▽C are determined by their signless ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics

سال: 2020

ISSN: 0972-8600,2543-3474

DOI: 10.1016/j.akcej.2018.06.009